On Vector-Kronecker Product Multiplication with Rectangular Factors
نویسندگان
چکیده
منابع مشابه
On Vector-Kronecker Product Multiplication with Rectangular Factors
The infinitesimal generator matrix underlying a multidimensional Markov chain can be represented compactly by using sums of Kronecker products of small rectangular matrices. For such compact representations, analysis methods based on vector-Kronecker product multiplication need to be employed. When the factors in the Kronecker product terms are relatively dense, vectorKronecker product multipli...
متن کاملOn rectangular Kronecker coefficients
We show that rectangular Kronecker coefficients stabilize when the lengths of the sides of the rectangle grow, and we give an explicit formula for the limit values in terms of invariants of sln.
متن کاملParallel Multiplication of a Vector by a Kronecker Product of Matrices (Part II)
The paper provides a generalization of our previous algorithm for the parallel multiplication of a vector by a Kronecker product of matrices. For any p, a factor of the problem size, our algorithm runs on p processors with a minimum number of communication steps and memory space. Specifically, on p processors with global communication, we show that the multiplication requires at least Θ(log(p))...
متن کاملShifted Kronecker Product Systems
Abstract. A fast method for solving a linear system of the form (A(p) ⊗ · · · ⊗ A(1) − λI)x = b is given where each A(i) is an ni-by-ni matrix. The first step is to convert the problem to triangular form (T (p) ⊗ · · · ⊗ T (1) − λI)y = c by computing the (complex) Schur decompositions of the A(i). This is followed by a recursive back-substitution process that fully exploits the Kronecker struct...
متن کاملKronecker Coefficients for Some Near-rectangular Partitions
We give formulae for computing Kronecker coefficients occurring in the expansion of sμ ∗ sν , where both μ and ν are nearly rectangular, and have smallest parts equal to either 1 or 2. In particular, we study s(n,n−1,1) ∗ s(n,n), s(n−1,n−1,1) ∗ s(n,n−1), s(n−1,n−1,2) ∗ s(n,n), s(n−1,n−1,1,1) ∗ s(n,n) and s(n,n,1) ∗ s(n,n,1). Our approach relies on the interplay between manipulation of symmetric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2015
ISSN: 1064-8275,1095-7197
DOI: 10.1137/140980326